Rumor detection with self-supervised learning on texts and social graph

نویسندگان

چکیده

Rumor detection has become an emerging and active research field in recent years. At the core is to model rumor characteristics inherent rich information, such as propagation patterns social network semantic post content, differentiate them from truth. However, existing works on fall short modeling heterogeneous either using one single information source only (e.g., network, or content) ignoring relations among multiple sources fusing content features via simple concatenation). Therefore, they possibly have drawbacks comprehensively understanding rumors, detecting accurately. In this work, we explore contrastive self-supervised learning sources, so reveal their characterize rumors better. Technically, supplement main supervised task of with auxiliary task, which enriches representations self-discrimination. Specifically, given two views a (i.e., encoding patterns), discrimination done by maximizing mutual between different same compared that other posts. We devise cluster-wise instance-wise approaches generate conduct discrimination, considering sources. term framework (SRD). Extensive experiments three real-world datasets validate effectiveness SRD for automatic media.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Detection of Rumor on Social Network

The rumor detection problem on social network has attracted considerable attention in recent years. Most previous works focused on detecting rumors by shallow features of messages, including content and blogger features. But such shallow features cannot distinguish between rumor messages and normal messages in many cases. Therefore, in this paper we propose an automatic rumor detection method b...

متن کامل

Revisiting Semi-Supervised Learning with Graph Embeddings

We present a semi-supervised learning framework based on graph embeddings. Given a graph between instances, we train an embedding for each instance to jointly predict the class label and the neighborhood context in the graph. We develop both transductive and inductive variants of our method. In the transductive variant of our method, the class labels are determined by both the learned embedding...

متن کامل

Semi-supervised Learning with Spectral Graph Wavelets

We consider the transductive learning problem when the labels belong to a continuous space. Through the use of spectral graph wavelets, we explore the benefits of multiresolution analysis on a graph constructed from the labeled and unlabeled data. The spectral graph wavelets behave like discrete multiscale differential operators on graphs, and thus can sparsely approximate piecewise smooth sign...

متن کامل

A Brief Survey on Semi-supervised Learning with Graph Regularization

In this survey, we go over a few historical literatures on semi-supervised learning problems which apply graph regularization on both labled and unlabeled data to improve classification performance. These semi-supervised methods usually construct a nearest neighbour graph on instance space under certain measure function, and then work under the smoothness assumption that class labels of samples...

متن کامل

Semi-Supervised Learning on an Augmented Graph with Class Labels

In this paper, we propose a novel graph-based method for semi-supervised learning. Our method runs a diffusion-based affinity learning algorithm on an augmented graph consisting of not only the nodes of labeled and unlabeled data but also artificial nodes representing class labels. The learned affinities between unlabeled data and class labels are used for classification. Our method achieves su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Frontiers of Computer Science

سال: 2022

ISSN: ['1673-7350', '1673-7466']

DOI: https://doi.org/10.1007/s11704-022-1531-9